/**
 * Say you have an array for which the ith element is the price of a given stock on day i.
 * Design an algorithm to find the maximum profit. You may complete at most k transactions.
 */
/**
 * @author I321035
 *
 */
package problem188_Best_Time_to_Buy_and_Sell_Stock_IV;